Generating Well-Distributed Point Sets with a Self-Similar Hierarchical Tile

نویسندگان

  • Ares Lagae
  • Philip Dutré
چکیده

We present a method for generating well-distributed point according to a given density. Our method is based on a single precomputed tile. The tile is both self-similar and hierarchical. A selfsimilar tile allows to increase the density of points in large steps by recursively subdividing the tile. A hierarchical tile allows to smoothly adjust the density of points. We present an interesting method to construct a self-similar point distribution, we show how to construct a well-distributed self-similar point distribution, and how to make a point distribution hierarchical. Our method is capable of generating well-distributed point sets in real time, using an algorithm that is easy to implement. However, because only a single tile is used, noticeable periodicity is introduced in the generated point distributions. Therefore, our method is somewhat better suited for applications that do not require point distributions with a high visual quality, such as sampling. Volume xx (200y), Number z, pp. 1–8 Generating Well-Distributed Point Sets with a Self-Similar Hierarchical Tile Ares Lagae & Philip Dutré Department of Computer Science Katholieke Universiteit Leuven † Abstract We present a method for generating well-distributed point according to a given density. Our method is based on a single precomputed tile. The tile is both self-similar and hierarchical. A self-similar tile allows to increase the density of points in large steps by recursively subdividing the tile. A hierarchical tile allows to smoothly adjust the density of points. We present an interesting method to construct a self-similar point distribution, we show how to construct a well-distributed self-similar point distribution, and how to make a point distribution hierarchical. Our method is capable of generating well-distributed point sets in real time, using an algorithm that is easy to implement. However, because only a single tile is used, noticeable periodicity is introduced in the generated point distributions. Therefore, our method is somewhat better suited for applications that do not require point distributions with a high visual quality, such as sampling.We present a method for generating well-distributed point according to a given density. Our method is based on a single precomputed tile. The tile is both self-similar and hierarchical. A self-similar tile allows to increase the density of points in large steps by recursively subdividing the tile. A hierarchical tile allows to smoothly adjust the density of points. We present an interesting method to construct a self-similar point distribution, we show how to construct a well-distributed self-similar point distribution, and how to make a point distribution hierarchical. Our method is capable of generating well-distributed point sets in real time, using an algorithm that is easy to implement. However, because only a single tile is used, noticeable periodicity is introduced in the generated point distributions. Therefore, our method is somewhat better suited for applications that do not require point distributions with a high visual quality, such as sampling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixed-point tile sets and their applicationsI

An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many fields, ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). We present a new construction of an aperiodic tile set that is based on Kleene’s fixed-point construction instead of geometric arguments. This const...

متن کامل

Fixed-point tile sets and their applications

An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many fields, ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). We present a new construction of an aperiodic tile set that is based on Kleene’s fixed-point construction instead of geometric arguments. This const...

متن کامل

Efficient methods for tile-based synthesis and computational photography

This thesis presents contributions to two major topics in computer graphics. The first part describes new algorithms for tile-based synthesis of blue noise point sets and solid textures; the second part describes systems for capturing, viewing, and manipulating outdoor photographs. Well distributed point sets play an important role in computer graphics, as well as many other fields, since they ...

متن کامل

A self-similar tiling generated by the minimal Pisot number

Let be a Pisot unit of degree 3 with a certain niteness condition. A large family of self similar plane tilings can be constructed, by the digit expansion in base . (cf. [7], [5], [8]) In this paper, we prove that the origin is an inner point of the central tile K. Further, in the case corresponds to the minimal Pisot number, we shall give a detailed study on the fractal boundary of each tile. ...

متن کامل

Fixed Point and Aperiodic Tilings

An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). We present a new construction of an aperiodic tile set that is based on Kleene’s fixed-point construction instead of geometric arguments. This constr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006